High rate transmit diversity transmission and reception

ABSTRACT

The performance and symbol rate in a wireless mobile system are increased by forming a transmission code matrix using transformed orthogonal codes, in such a way that the code is robust to channel statistics and operates well in both Ricean and (correlated) Rayleigh channels. Furthermore, the invention enables high symbol rate transmission using multiple transmit antennas, and one or multiple receive antennas, and obtains simultaneously high diversity order and high symbol or data rate.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application claims priority from U.S. provisional application 60/346,482 filed Jan. 4, 2002, which application is hereby incoporated by reference.

FIELD OF THE INVENTION

This invention relates to methods and systems for achieving joint high data transmission and diversity in both space and time/frequency in a telecommunication system.

BACKGROUND OF THE INVETION

Signal transmission in wireless communication systems is subject to fading which often reduces the achievable throughput and data rates or achievable quality-of-service. Transmission environments with obstacles lead to multi-path signal propagation, and the power of combined effective received signal power can diminish reducing the link capacity significantly. In addition, due relative speed between the transmitter and the receiver, or the intermediate objects between the transmitter and the receiver, the fading changes dynamically in time and space.

A typical countermeasure for a fading channel is to employ receiver diversity with multiple receive antennas. Multiple receive antennas are often expensive to implement and subsequently alternative solutions have been sought for. Transmit diversity is an alternative solution in which more than one transmit antenna is used to transmit the signal. Both of these techniques create artificial multi-path channels and the probability that all channels fail simultaneously is significantly reduced, thus improving the quality of the received signal.

One transmit diversity solution is disclosed in U.S. Pat. No. 6,185,258 to Alamouti et al., which is incorporated herein by reference. The Alamouti matrix C_(Ala) is shown below in equation (1), with each row corresponding to a transmit antenna, or a beam, and each column corresponding to a symbol period. $\begin{matrix} {{C_{Ala}\left( {z_{1},z_{2}} \right)} = \begin{bmatrix} z_{1} & {- z_{2}^{*}} \\ z_{2} & z_{1}^{*} \end{bmatrix}} & (1) \end{matrix}$

The Alamouti scheme is called a 2 by 2 space-time block code, as it employs two transmit antennas or beams during two symbol periods. As an alternative of time-division, transmitting different columns during different symbol periods, any other substantially orthogonal division of the available transmission resources may be used, e.g. different frequency subcarriers or Fourier/wavelet waveforms (space-frequency code) or different (spreading) codes (space-code-code) may be used. To stress this multitude of uses of a given code matrix, the term “transmit diversity code” shall be used for codes of the type discussed above, which may be used when a spatial (antenna or beam) dimension is available, together with any substantially orthogonal division of other transmission resources, including time and bandwidth. The transmit diversity of the Alamouti code is two, as taught in the U.S. Pat. No. 6,185,258. The symbol rate is one, since two symbols are transmitted in two time slots. The code formed according to equation (1) is orthogonal, in the sense that, when multiplied together with its Hermitian transpose, it yields a scaled identity matrix. The Hermitian transpose of a matrix A, denoted by A^(H), is the complex conjugate transpose of A. The transpose of a matrix is derived by reversing the row and column indices of the matrix. The identity matrix, denoted “I”, is a matrix with each element on its diagonal equal to unity and all other elements each to zero. Accordingly, for an orthogonal-based matrix A, it holds that A^(H)A=AA^(H)=kI, for some real value k The orthogonality of the Alamouti matrix enables separate decoding of the two symbols, in such a way that that symbols do not interfere with each other.

The Alamouti transmit diversity is optimized for channels in which there is little or no intersymbol interference (ISI) on the channel. ISI distorts the received signal and exacerbates reception, thus reducing signal quality. The time delayed signals, also known as temporal multi-path components, can be also advantageous. In CDMA systems one may, as an example, employ a separate transmit diversity block code decoder for each multi-path component, and then combine the output using any suitable diversity combining method, including as an example equal gain combining, or maximal ratio combining. Alternatively, an equalizer may be used to combine the multi-path propagated signals, and possibly to simultaneously remove inter-symbol-interference. Lindskog and Paulraj have proposed in “A Transmit Diversity Scheme for Channels with Intersymbol Interference”, Proc. IEEE ICC2000, 2000, vol. 1, pp. 307-311, an orthogonal transmit diversity block code that, unlike the Alamouti code, is effective on ISI channels. This paper is incorporated herein by reference.

Orthogonal transmit diversity codes suffer from rate limitation problems, as taught in O. Tirkkonen and A. Hottinen, “Complex space-time block codes for four Tx antennas” in Proc. Globecom 2000, San Francisco, USA, November/December 2000, incorporated herein by reference. As an example, the maximal symbol rate for an orthogonal transmit diversity code with four transmit antennas or beams is ¾. When the rate loss is not desired the code orthogonality has to be sacrificed. Indeed, O. Tirkkonen, A. Boariu, A. Hoffinen, “Minimal non-orthogonality space-time code for 3+ transmit antennas,” in Proc. IEEE ISSSTA 2000, September, NJ, USA, teach one such method (e.g. the ABBA code). In this code the signal is transmitted in using the transmit diversity code matrix $\begin{matrix} {C_{NOSTBC} = \begin{bmatrix} z_{1} & {- z_{2}^{*}} & z_{3} & {- z_{4}^{*}} \\ z_{2} & z_{1}^{*} & z_{4} & z_{3}^{*} \\ z_{3} & {- z_{4}^{*}} & z_{1} & {- z_{2}^{*}} \\ z_{4} & z_{3}^{*} & z_{2} & z_{1}^{*} \end{bmatrix}} & (2) \end{matrix}$

It is seen that the code comprises as sub-matrices the Alamouti code. The aforementioned paper is incorporated herein by reference. The code described above yields good performance in a fading channel but due to the structure of the non-orthogonality, there is an inherent performance loss in correlated channels or in Ricean channels, where known orthogonal transmit diversity codes perform better. The performance of non-orthogonal codes, exemplified by (2), can be improved by employing possibly matrix valued constellation rotations, as discussed in O. Tirkkonen, “Optimizing space-time block codes by constellation rotations,” Finnish Wireless Communications Workshop, October 2001, which is incorporated here by reference. The idea is that if the symbols in different orthogonally encoded blocks, exemplified by the pairs z1, z2 and z3,z4 in (2) are taken from different constellations, the performance of the code is much improved. This can be realized by constellation rotations.

A simpler, limited diversity space-time code construction has been proposed for WCDMA systems. The orthogonal code is called STTD-OTD in 3GPP document TSGR1 #20(01)-0578, incorporated herein by reference. It combines two Alamouti codes in such a way that the symbol rate is one (with four transmit antennas), but so that the system only enjoys limited diversity order. The transmission code matrix is $C_{{STTD} - {OTD}} = \begin{bmatrix} z_{1} & z_{1} & z_{2} & z_{2} \\ {- z_{2}^{*}} & {- z_{2}^{*}} & z_{1}^{*} & z_{1}^{*} \\ z_{3} & {- z_{3}} & z_{4} & {- z_{4}} \\ {- z_{4}^{*}} & z_{4}^{*} & z_{3}^{*} & {- z_{3}^{*}} \end{bmatrix}$

With four antennas the diversity order is only two when four is the maximum achievable. It is noted that the STTD-OTD code above contains two Alamouti blocks, and it can be written using the Alamouti marix, given earlier, after changing the column indices 2 and 3. Alternatively, to obtain essentially the same diversity as with STTD-OTD one may combine antenna hopping and the Alamouti code, in which case the space-time matrix is $\begin{matrix} {C_{{STTD} - {AHOP}} = \begin{bmatrix} z_{1} & {- z_{2}^{*}} & \quad & \quad \\ z_{2} & z_{1}^{*} & \quad & \quad \\ \quad & \quad & z_{3} & {- z_{4}^{*}} \\ \quad & \quad & z_{4} & z_{3}^{*} \end{bmatrix}} & (3) \end{matrix}$

It is seen that the matrix contains four symbols and occupies four time slots, and hence the symbol rate is one, although all symbols are not transmitted from all antennas, thus limiting the achievable diversity to two.

Transmit diversity block codes have been designed also for parallel high rate transmission over fading channels, as taught by O. Tirkkonen and A. Hottinen, “Improved MIMO transmission using non-orthogonal space-time block codes,” in Proc. Globecom 2001, November/December 2001, San Antonio, Tex., USA, incorporated herein by reference. In this method, two transmit antennas and two receive antennas are used advantageously to obtain both transmit/receive diversity benefit and increased data or symbol rate.

High rate space-time transmission concepts have been considered also for future WCDMA systems. Indeed, in the Third Generation Partnership Program (3GPP) document “Improved Double-STTD schemes using asymmetric modulation and antenna shuffling” TSG-RAN Working Group 1 (TSGR1 #20(01)-0459) by Texas Instruments (incorporated herein by reference), proposed parallel transmission of Alamouti codes using four transmit antennas and two or four receive antennas. Although this method improves the symbol rate by a factor of two it obtains only limited diversity order, which limits the performance and realizable data rates.

SUMMARY OF THE INVENTION

It is an aim of embodiments of the present invention to address one or more of the problems discussed above.

The present invention provides a method to transmit complex symbols using a transmission matrix, said method comprising the steps of converting a stream of complex symbols to at least two at least partially different streams of complex symbols, a modulating said at least two streams of complex symbols to form at least two code matrices, at least one of which is of dimension greater than one, transforming said code matrices using linear transformations, to construct at least two transformed transmit diversity code matrices, constructing a transmission code matrix using at least two transformed transmit diversity code matrices, and transmitting said transmission code matrix, at least partially in parallel, using substantially orthogonal signaling resources and at least three different transmit antenna paths.

It is also an object of the invention to provide a method and apparatus for receiving a signal comprising a channel estimation module that outputs estimates of the impulse response estimates from each transmit antenna path to each receive antenna, and a detection module that uses the structure of a transmission matrix, said matrix comprising at least one linear combination of two orthogonal space-time code matrices or channel symbols, and channel impulse response estimates to calculate bit or symbol estimates for transmitted signal stream or streams.

It is further an object of the invention to provide an apparatus to transmit complex symbols using a transmission matrix, said apparatus comprising conversion means for converting a stream of complex symbols to at least two at least partially different streams of complex symbols, modulating means for modulating said at least two streams of complex symbols to form at least two code matrices, at least one of which is of dimension greater than one, transforming means for transforming said code matrices using linear transformations, to construct at least two transformed transmit diversity code matrices, code constructing means for constructing a transmission code matrix using at least two transformed transmit diversity code matrices and transmission means for transmitting said transmission code matrix, at least partially in parallel, using substantially orthogonal signaling resources and at least three different transmit antenna paths.

Other objects and characteristics of the present invention are apparent from the detailed descriptions explained in conjunction with the related drawings. The drawings are designed only to illustrate the inventive concept, and in no way limit the application of the invention, for which reference should be made to the appended claims.

BRIEF DESCRIPTION OF THE DRAWINGS

In the drawings:

FIG. 1 depicts an exemplary transmit diversity system in accordance with the present invention;

FIG. 2 depicts an exemplary receiver system for the proposed high rate transmission method

FIG. 3 depicts a multi-antenna transmitter-receiver pair in accordance with the invention.

DETAILED DESCRIPTION OF THE INVENTION

Reference is made to FIG. 1, which illustrates a high rate transmitter diversity system which includes a transmitting apparatus 101, such as a base station, and a receiver 102, such as a mobile phone. The transmitting apparatus 101 includes serial-to-parallel (S/P) module 103, a plurality of transmit diversity modulation modules for constructing orthogonal matrices 104, at least one transform module 105, code construction module 106, signaling/spreading modules 107 and a plurality of RF (Radio Frequency) modules that convert the signal to analog waveforms 108, and transmitting antennas 109. The receiver 102 includes possibly more than one receiving antennas.

The S/P module 103 converts the possibly channel coded (ENC) (e.g. Turbo coded or convolutional coded) and modulated (MOD) complex valued symbol streams into at least two parallel complex valued symbol streams in which at least some of the complex symbols are different from each other. In modules 104, the two symbol streams are separately transmit diversity coded, using orthogonal (transmit diversity) code matrices C1 and C2, each of arbitrary dimension and rate. The symbols in the (transmit diversity) code matrices C1 and C2, or the (transmit diversity) code matrices themselves are mixed using a linear transformation U in module 105, to generate transformed transmit diversity code matrices X1 and X2. The transformed code matrices X1 and X2 are used to construct a transmission code matrix in C the code construction module 106. The transmission code matrix is transmitted using at least three transmit antennas or paths or beams 109 using any substantially orthogonal signaling, e.g. different orthogonal codes (e.g. Hadamard codes) or different time slots or different Fourier waveforms (OFDM waveforms/subcarriers) or different frequency bands can be used. If optional parallel transmission is used to increase the symbol rate the S/P module can output more than two symbol streams 110, to be eventually combined with other parallel streams or code matrices in code construction module 106.

As an example, the transformed code matrices can be formed in the transform module 105 as follows: X 1=C 1+C 2 X 2=C 1−C 2 in which C1 and C2 are two orthogonal transmit diversity codes, e.g. the 2 by 2 Alamouti matrices. It should be stressed that normalization, to maintain target symbol energy by diving by {square root}{square root over (2)}, has been omitted for simplicity.

To further improve performance, the symbols in the respective orthogonal transmit diversity codes C1, C2 may be taken from different modulation alphabets, effected e.g. by constellation rotations. This may be incorporated in the serial-to-parallel module (103), which may be more generally considered as a conversion means for converting a stream of complex symbols to multiple streams of complex symbols. Alternatively, or in addition, the transform module 105 may be generalized so that the transmission matrices are be formed using a unitary transformation matrix U, as X=UC  (5), where (assuming only two code matrices are transformed) $C = \begin{bmatrix} {C1} \\ {C2} \end{bmatrix}$ and U is for example, of the form U=V{circle over (×)}I where V is a Unitary matrix and I is an identity matrix. Matrix V may assume the parameterized form $V = {\begin{bmatrix} \mu & \gamma \\ {- \gamma^{*}} & \mu^{*} \end{bmatrix}.}$

The Kronecker product, when combined with the identity matrix, maximizes the number of zero elements on the transformation marix, and this reduces the peak-to-average ratio in the transmitter and provides a simple implementation. We may also further parameterize μ={square root}{square root over (α)}; γ={square root}{square root over (1−α)}exp(−jφπ) where α determines the relative powers within the linear combination matrix and φ a determines the phase of a complex phasor. The simple transformation (4) is obtained by setting α=½,φ=0.

Return for simplicity to the special case provided in equation (4). The code construction module 106 takes the transformed transmit diversity code matrices X1 and X2 resulting form the linear combinations and constructs a transmission code matrix. For this, the code construction module 106 embeds the matrices X1 and X2 into a transmission code matrix with double the dimensions. The transformed code matrices can advantageously be transmitted in different time slots (time-orthogonal signaling) using four transmit antennas using a transmit diversity transmission code matrix $\begin{matrix} {C_{{TR} - {AHOP}} = {\begin{bmatrix} {X1} & \quad \\ \quad & {X2} \end{bmatrix}.}} & (6) \end{matrix}$

Alternatively, to maintain better power balance one may transmit continuously using e.g. the transmit diversity transmission code matrix $\begin{matrix} {C_{{Tr} - {OTD}} = \begin{bmatrix} {X1} & {X2} \\ {X1} & {- {X2}} \end{bmatrix}} & (7) \end{matrix}$

These transmission code matrices can be subjected e.g. to column and/or row permutations without affecting the code properties. The transmission code matrices may also be subjected to multiplying from the left and/or with a constant matrix.

To understand the benefits of the use of said linear (unitary) combinations, recall that the received signal (for simplicity in a flat fading channel) can be described as, y=Ch+n, where h is the vector of channel coefficients to a given receive antenna. An equivalent model signal model follows, when symbols within X1 and X2 and the channel matrix/vector are rearranged, y′=Hb+n′, where H depends on the code matrix and the channel, b is a symbol or a bit vector, where different dimensions correspond to different transmitted symbol or bit streams. When symbols are QPSK modulated with Gray labeling, b may be considered to comprise I and Q components of each symbol, thus increasing the dimensionality of the vector by a factor of two.

The received equivalent correlation matrix, which can be used when detecting the symbols or bits, follows, when a space-time matched filter (i.e., conjugate transpose of H) is applied to the received signal y′, to form a equivalent signal model after space-time matched filter z=Rb+n″, where R is called an equivalent channel correlation matrix. This model can be used be the corresponding receiver e.g. by estimating the symbols or bits by minimizing (wrt. b) ∥z−Rb∥², possibly under colored noise or, as an alternative, one may solve directly ∥y−Hb∥², where, as above, H is the equivalent channel matrix that depends on the transmission matrix. Detectors solving these equations are well-known. However, in order to arrive at these models we need to make sure the model matches the properties of channel vector/matrix and and transmission code matrix. As an example, When estimating bits or symbols using the equivalent channel correlation matrix, we need to know said matrix. For example, for codes (6) and (7), with α=1, φ=0, and with four transmit antennas, this results in code correlation matrix with structure $\begin{matrix} {{R = {{aI}_{NT} + {\begin{bmatrix} 0 & b \\ b & 0 \end{bmatrix} \otimes I_{2}}}}{with}} & (8) \\ \begin{matrix} {a = {\sum\limits_{j = {1:{NR}}}^{\quad}{\sum\limits_{i = {1:{NT}}}^{\quad}{h_{ij}}^{2}}}} \\ {b = {{\sum\limits_{j = {1:{NR}}}^{\quad}{\sum\limits_{i = {1:{{NT}/2}}}^{\quad}{h_{ij}}^{2}}} - {\sum\limits_{j = {1:{NR}}}^{\quad}{\sum\limits_{i = {1:{{{{NT}/2} + 1}:{NT}}}}^{\quad}{h_{ij}}^{2}}}}} \end{matrix} & (9) \end{matrix}$

Thus, the code above is non-orthogonal since the off-diagonal correlation values do not vanish. Correspondingly when α=1, φ=0 (in this special case the transmission code matrix reduces to STTD-OTD, known from prior art) $R = \begin{bmatrix} {a_{1}I_{2}} & 0 \\ 0 & {a_{2}I_{2}} \end{bmatrix}$ where $\begin{matrix} {a = {\sum\limits_{j = {1:{NR}}}^{\quad}{\sum\limits_{i = {1:{{NT}/2}}}^{\quad}{h_{ij}}^{2}}}} \\ {b = {\sum\limits_{j = {1:{NR}}}^{\quad}{\sum\limits_{i = {1:{{{{NT}/2} + 1}:{NT}}}}^{\quad}{h_{ij}}^{2}}}} \end{matrix}$ where

This reflects the fact that different symbols obtain only partial transmit diversity, whereas in (8)-(9) the diagonal elements are identical, and thus all symbols obtain same power regardless of the channel realization. The equivalent correlation matrix can be used when detecting the symbols or bits. It is essential to notice that the code correlation matrix of the proposed code differs from that of prior art (e.g. ABBA) so that the former depends explicitly on channel power differences, while the latter depends on complex phases of the channel. This property of the inventive code can be used to advantage, when increasing the data rates of the transmission quality of the transmission system. In particular, the invented code is orthogonal when the channel is fully correlated, and in general the correlation coefficient diminishes as the channel correlation increases. Therefore, the code is suitable also for correlated channels, that can be described e.g. as correlated Rayleigh or Ricean channels. Conversely, the prior art non-orthogonal code (ABBA) remains non-orthogonal in these channels. The correlation properties of the physical channel depend on the environment, but it is generally known that antenna correlation increases when the transmitting or the receiving antennas are close to each other. With small base stations and especially with small terminals (mobile stations) this is likely the case in the future wireless systems.

To recapitulate, a general linear transformation matrix U, holds the aforementioned transformation (4), and the prior art code (known as STTD-OTD with 4 transmit antennas) as a special case: Transformation (4) is obtained by setting α=½, φ=0, and STTD-OTD code by setting α=1. When ½<α<1 the code provides smaller transmit diversity benefit, as the diagonal values of the code correlation matrix differ from each each other more than in Equation (8). The advantage is that the code correlation values are smaller in magnitude. This simplifies detection in the receiving unit. In the extreme case, the code reduces to an orthogonal STTD-OTD like code, in the sense that the code correlation values (off-diagonal values of the code correlation matrix) are zero. It should be noted that the correlation matrix of the proposed code also leads to advantageous properties when the code is used on properly equalized ISI channels; the multipath components attenuate the non-orthogonality of the code. For this, the individual symbols may be interpreted as vectors of multiple symbols.

It is noted that when the constituent matrices C1 and C2 are both Alamouti matrices, the obtained code has symbol rate at least one (at least four different symbols can be transmitted in four time slots). The inventive transmission concept can also be used when increasing the symbol rate of the transmitting device. In this case several transformed transmit diversity code matrices are transmitted in parallel, preferably continuously to minimize power fluctuations in the transmitter (i.e. to minimize peak-to-average ratio in the RF power amplifiers). To this effect, a particularly advantageous embodiment is to fill up the anti-diagonal part of the TR-AHOP matrix above as follows $\begin{matrix} {{C_{{2{TR}} - {AHOP}} = \begin{bmatrix} {X1} & {X3} \\ {X4} & {X2} \end{bmatrix}},} & (10) \end{matrix}$ in which the matrices X3 and X4 are formed analogously using linear transformations. Advantageously, the linear transformations used to construct X3 and X4 are different from the ones used to construct X1 and X2. For example, the modulation alphabets of symbols used to construct X3 and X4 may be different than the modulation alphabets of symbols used to construct X1 and X2. In effect, four parallel complex symbol streams are formed, a transformation is applied to two streams separately, and the two transformed transmit diversity code matrices are transmitted simultaneously and continuously from the transmitting devices, such that pair X1 and X2, and pair X3 and X4 both obtain full diversity benefit, and typically interference from each other.

The invention is in not way limited to the use of the Alamouti transmit diversity code as submatrices of the transformed code. In general, any orthogonal transmit diversity code defined for any number of transmit antennas can be used. All possible orthogonal transmit diversity code matrices were constructed in the patent application, WO/63826 A1, which is incorporated herein by reference. As an example codes C1 and C2 can be rate ¾ transmit diversity codes defined each for four transmit paths or antennas, in which case the resulting code is defined for eight transmit paths or antennas, with overall symbol rate ¾. Hence the rate is increased when compared to orthogonal transmit diversity codes, in which rate ½ cannot be exceeded using eight antennas, as is well known from prior art. Alternatively, code C2 may be defined (as taught in prior art) to have e.g. rate ½, while C1 has rate ¾ in which case the overall rate is ⅝.

Thus, the space time-code matrices C1 and C2 need not be the same, to enable a large number of different symbol rates. In addition, they need not even have the same dimension. Hence, (recalling the fact that the code dimension depends on the number of antennas), by using different code dimensions enables one to divide the transmitting elements (antennas) asymmetrically for the transformed code X1 and X2. As an example, if C1 is the Alamouti code of dimension two and C2 is rate ¾ code of dimension four (Appendix 1, eq. (4)), we have effectively symbol rate ⅞ and 6 antenna transmission, and C2 is defined as $\begin{matrix} {{C2} = \begin{bmatrix} {C1}^{\prime} & {C2}^{\prime} \\ {C1}^{\prime} & {- {C2}^{\prime}} \end{bmatrix}} & (11) \end{matrix}$ where C1′ and C2′ are two Alamouti codes (essentially STTD-OTD transmit diversity transmission matrix) formed with two different symbols. If the dimension is not the same it is understood that either the matrix with smaller dimension is canonically filled up with zeros when transforming the codes, or that the larger matrix is punctured (e.g. columns deleted), to allow the use of arbitrary number of transmit antennas, e.g. 6 in the above exemplary case.

FIG. 2 depicts a corresponding receiver, consisting of one or a plurality of receive antenna, and RF front-end modules 201, and despreading or channel-division units 202, that convert the signal to base band in which the space-time matched-filters and channel estimates provided by 203 together with suitable detection device 204 for detecting the symbols or bits in embedded in the transmission code matrix. The channel estimation unit 203 determines the complex channel coefficient for each transmit antenna-receive antenna pair. In a preferred embodiment the receiving unit uses the channel estimates (and perhaps also signal-to-noise ratio estimates) to construct the effective correlation matrix depending on the used transformation matrix. An explicit example for Transformation (4) was shown in equations (8) and (9) above. The detection device 204 can be any decoder or a joint-decoder and channel estimation unit, e.g. forming Minimum-Mean-Square-Error (MMSE) estimates of the transmitted symbols, or Maximum Likelihood estimates e.g. by a Viterbi algorithm, or soft-outputs (a posteriori probabilities) by an optimal or suboptimal MAP algorithm. Joint detection is enabling by allowing feedback and feedforward connections via 206 between the outputs delivered by detection, channel estimation, channel decoding units. Eventually, the channel decoder (e.g. Turbo decoder) forwards the decisions to other receiver units or to the targeted sink of the particular the source. These receiver concepts are generally well known, but when applied in the context of the present invention the receiver can utilize the code structure used in the transmitter, and possibly also the code correlation matrix similar to that of equation (8), for example.

While there have been shown and described and pointed out fundamental novel features of the invention as applied to preferred embodiments thereof, it will be understood that various omissions and substitutions and changes in the form and details of the methods described and devices illustrated, and in their operation, may be made by those skilled in the art without departing from the spirit of the invention. For example, it is expressly intended that the method can be used with any substantially orthogonal signaling when transmitting the transformed transmit diversity code matrices over the channel. This includes the use of OFDM waveforms, wavelets, time-orthogonal waveforms, FDMA, and arbitrary substantially orthogonal spreading codes. Furthermore, the complex symbols modulating the entries of the transmit diversity code matrices can be from arbitrary complex modulation alphabets (QPSK, 8-PSK, 16-QAM, 4-PSK), or (possibly matrix valued) constellation rotated versions of these, and that different alphabets can be used for different streams of complex symbols. Also, the bits that are encoded in the complex symbols may be channel coded and/or interleaved. The channel code may be a block code, a trellis code, a convolutional code, a turbo code, a low-density parity check code, or any combination of these or any other code known in the art. The interleaver may be a bit, symbol or coordinate interleaver. The transmit paths to which the columns of the transmit diversity code matrix are transmitted can be formed by beams using at least two transmitting elements, or fixed beams using e.g. a Butler matrix, or by using beams controlled by the received using some feedback loop, or by any other method known in prior art to form a transmit path or transmit pats from the transmitter to the receiver. In addition, it is clear that although the method of the invention requires only one channelization waveform or code, if more than one are available the data rate can be directly increased using multicode transmission. Furthermore, it is considered apparent that the channel estimates required to detect the streams of complex symbols can be obtained e.g. by using common channel pilots, or dedicated channel pilots, or by using decision feedback, or any combination thereof. Also, for ISI channels it is possible to transmit symbol-vectors instead of symbols, with appropriate interpretations of the complex-conjugations, without parting from the scope of this invention. It is the intention, therefore, to be limited only as indicated by the scope of the claims appended hereto. 

1-30. (canceled)
 31. A method of transmitting complex symbols using a transmission code matrix, said method comprising: constructing said transmission code matrix, wherein each of said complex symbols forms part of at least two elements of said transmission code matrix and wherein at least some of said matrix elements are formed by linearly mixing at least two of said complex symbols; and transmitting said transmission code matrix, at least partially in parallel, using substantially orthogonal signalling resources and at least three different transmit antenna paths.
 32. The method of claim 31, wherein constructing said transmission code matrix comprises: converting a stream of complex symbols to at least two at least partially different streams of complex symbols; modulating said at least two streams of complex symbols to form at least two code matrices, at least one of which is of dimension greater than one; transforming said code matrices using linear transformations, to construct at least two transformed transmit diversity code matrices; and transmit diversity code matrices.
 33. The method of claim 32, wherein at least one of the linear transformations is different from an identity transformation.
 34. The method of claim 32, wherein the at least two code matrices are orthogonal code matrices.
 35. The method of claim 32, wherein both the matrix dimensions of the transmission code matrix are greater than the corresponding matrix dimensions of the transformed transmit diversity code matrices.
 36. The method of claim 35, wherein the transmission code matrix is constructed from the transformed transmit diversity code matrices using the method of embedding a lower-dimensional matrix into a higher-dimensional one.
 37. The method of claim 32, wherein the transmission code matrix is constructed from the transformed transmit diversity code matrices using at least one of the methods of repetition, negation, conjugation, permutation, multiplying with a matrix.
 38. The method of claim 32, wherein the first transformed code matrix is constructed by summing two code matrices, and the at least the second transformed code matrix is constructed by subtracting the said two code matrices.
 39. The method in claim 34, wherein the symbol rate of the transmission matrix is the same as the average symbol rate of the orthogonal code matrices to which the linear transformations are applied.
 40. The method of claim 31, wherein the transmission code matrix extends over T substantially orthogonal signaling resources, and wherein more than T complex symbols are used to construct the transmission code matrix.
 41. The method of claim 32, wherein the step of constructing the at least two streams of complex symbols contains a serial-to-parallel conversion.
 42. The method of claim 32, wherein the step of constructing the at least two streams of complex symbols contains a rotation unit.
 43. The method of claim 42, wherein the rotation unit is a symbol rotation matrix that differs from an identity matrix, and contains at least two zero-elements.
 44. The method of claim 42, wherein the rotation unit is a symbol rotation matrix that is formed as Kroneker product of two unitary matrices, where at least one is different from an identity matrix.
 45. The method of claim 43, wherein the symbol rotation matrix is a diagonal matrix, where at least one diagonal element is a complex number.
 46. The method of claim 40, wherein at least two transformed transmit diversity code matrices are transmitted in parallel, and wherein the two transformed transmit diversity code matrices contain at least partially different symbols.
 47. The method of claim 40, wherein a part of the symbols are transmitted on a block-diagonal sub-matrix within the transmission code matrix, and at least partly different symbols are transmitted on an anti-block-diagonal sub-matrix within the transmission code matrix.
 48. The method of claim 40, wherein there are four substreams and wherein each substream is modulated to form an orthogonal 2×2 code matrix incorporating two complex symbols, and wherein the transmission code matrix extends over at least four substantially orthogonal signaling resources.
 49. The method of claim 32 wherein at least one code matrix has a different symbol rate than another code matrix.
 50. The method of claim 32, wherein at least one code matrix has different dimensions than another code matrix.
 51. The method of claim 32, wherein at least one code matrix is transmitted with different power than another code matrix.
 52. The method of claim 32, wherein the substantially orthogonal signaling resources include at least one of the following: non-overlapping time slots, different spreading codes, different OFDM subcarriers, different wavelet waveforms and different FDMA channels.
 53. An apparatus for transmitting complex symbols using a transmission code matrix, said apparatus comprising: components which are adapted to construct a transmission code matrix out of complex symbols, wherein each of said complex symbols forms part of at least two elements of said transmission code matrix and wherein at least some of said matrix elements are formed by linearly mixing at least two of said complex symbols; and transmission means adapted to transmit said transmission code matrix, at least partially in parallel, using substantially orthogonal signalling resources and at least three different transmit antenna paths.
 54. The apparatus of claim 53, wherein said components adapted to construct a transmission code matrix comprise: conversion means for converting a stream of complex symbols to at least two at least partially different streams of complex symbols; modulating means for modulating said at least two streams of complex symbols to form at least two code matrices, at least one of which is of dimension greater than one; transforming means for transforming said code matrices using linear transformations, to construct at least two transformed transmit diversity code matrices; and code constructing means for constructing a transmission code matrix using at least two transformed transmit diversity code matrices.
 55. The apparatus of claim 54, wherein the transforming means applies at least one linear transformation different from an identity transformation.
 56. The apparatus of claim 54, wherein the modulating means forms orthogonal code matrices.
 57. A system comprising a transmitter for transmitting complex symbols using a transmission code matrix, and a receiver for receiving transmitted complex symbols, said transmitter comprising: components which are adapted to construct a transmission code matrix out of complex symbols, wherein each of said complex symbols forms part of at least two elements of said transmission code matrix and wherein at least some of said matrix elements are formed by linearly mixing at least two of said complex symbols; and transmission means adapted to transmit said transmission code matrix, at least partially in parallel, using substantially orthogonal signalling resources and at least three different transmit antenna paths.
 58. A transmission code matrix, which is to be transmitted at least partially in parallel on at least three different transmit antenna paths using substantially orthogonal signalling resources, said transmission code matrix being constructed based on complex symbols which are to be transmitted, wherein each of said complex symbols forms part of at least two elements of said transmission code matrix and wherein at least some elements of said transmission code matrix comprise a linear mixture of at least two of said complex symbols.
 59. The transmission code matrix of claim 58, wherein said complex symbols are four complex symbols and wherein said transmission code matrix comprises 4×4 elements.
 60. The transmission code matrix of claim 58, wherein said complex symbols comprise a first group of four complex symbols and a second group of four complex signals, wherein said transmission code matrix comprises 4×4 elements, and wherein said complex symbols are linearly mixed within a respective group in said transmission code matrix.
 61. A method for receiving a signal comprising: estimating the impulse response estimates from each transmit antenna path to each receive antenna, calculating bit or symbol estimates for transmitted signal stream or streams using the structure of a transmission matrix, said matrix comprising at least one linear combination of two orthogonal space-time code matrices or channel symbols, and said channel impulse response estimates.
 62. The method of claim 61, wherein the bit or symbol estimates are hard decisions corresponding to the symbol alphabet used in the modulator.
 63. The method of claim 61, wherein the bit or symbol decisions are soft decisions that reflect the reliability of the decision.
 64. The method of claim 63, wherein the reliability is derived from bit or symbol a-posteriori probabilities.
 65. The method of claim 61, wherein the transmitted bits or symbols streams are channel coded, and the detector performs joint detection and decoding over transmission code matrix and the channel code decoder.
 66. The method of claim 65, wherein the joint detection and decoding method uses reliability estimates calculated for transmitted symbols or bits.
 67. An apparatus for receiving a signal comprising: a channel estimation module that outputs estimates of the impulse response estimates from each transmit antenna path to each receive antenna; and a detection module that uses the structure of a transmission matrix, said matrix comprising at least one linear combination of two orthogonal space-time code matrices or channel symbols, and channel impulse response estimates to calculate bit or symbol estimates for transmitted signal stream or streams.
 68. The apparatus of claim 67, wherein the bit or symbol estimates are hard decisions corresponding to the symbol alphabet used in the modulator.
 69. The apparatus of claim 67, wherein the bit or symbol decisions are soft decisions that reflect the reliability of the decision.
 70. The apparatus of claim 69, wherein the reliability is derived from bit or symbol a-posteriori probabilities.
 71. The apparatus of claim 67, wherein the transmitted bits or symbols streams are channel coded, and the detector performs joint detection and decoding over transmission code matrix and the channel code decoder.
 72. The apparatus of claim 71, wherein the joint detection and decoding method uses reliability estimates calculated for transmitted symbols or bits. 